Optimal thrust level for orbit insertion
نویسندگان
چکیده
منابع مشابه
Low-Thrust Optimal Orbit Raising with Plane Change
A new guidance scheme for the problem of Low-thrust transfer between inclined orbits is developed within the framework of optimal control theory. The objective of the guidance scheme is to provide the appropriate thrust steering program that will transfer the vehicle from an inclined low earth orbits to the high earth orbits. The presented guidance scheme is determined using Pontryagin’s princi...
متن کاملThrust - Limited Optimal Three - Dimensional Spacecraft Trajectories
Several optimal three-dimensional orbital transfer problems are solved for thrust-limited spacecrafts using collocation and nonlinear programming techniques. The solutions for full nonlinear equations of motion are obtained where the integrals of the free Keplerian motion in three dimensions are utilized for coasting arcs. In order to limit the solution space, interior-point constraints are use...
متن کاملMulti-Objective Evolutionary Algorithms for Low-Thrust Orbit Transfer Optimization
We address the problem of optimizing a spacecraft trajectory by using three different multi-objective evolutionary algorithms: i) Non-dominated sorting genetic algorithm, ii) Pareto-based ranking genetic algorithm, and iii) Strength Pareto genetic algorithm. The trajectory of interest is an orbit transfer around a central body when the spacecraft uses a lowthrust propulsion system. We use a Lya...
متن کاملLyapunov-based Low-thrust Optimal Orbit Transfer: An approach in Cartesian coordinates
This paper presents a simple approach to low-thrust optimal-fuel and optimal-time transfer problems between two elliptic orbits using the Cartesian coordinates system. In this case, an orbit is described by its specific angular momentum and Laplace vectors with a free injection point. Trajectory optimization with the pseudospectral method and nonlinear programming are supported by the initial g...
متن کاملEdge Insertion for Optimal
The edge-insertion paradigm improves a triangulation of a nite point set in < 2 iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations. Any opinions, nding and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Astronautica
سال: 2017
ISSN: 0094-5765
DOI: 10.1016/j.actaastro.2017.02.024